#include <iostream>

using namespace std;
typedef long long LL;
const int MOD = 1e5 + 3, N = 2010;
LL f[N], g[N];
LL qpow(LL a, LL b, LL p)
{
	LL ret = 1;
	while (b)
	{
		if (b & 1) ret = ret * a % p;
		a = a * a % p;
		b >>= 1;
	}
	return ret;
}
LL C(int n, int m)
{
	if (m > n) return 0;
	return f[n] * g[m] % MOD * g[n - m] % MOD;
}
void init()
{
	int n = N;
	f[0] = 1;
	for (int i = 1; i <= n; i++) f[i] = f[i - 1] * i % MOD;
	g[n] = qpow(f[n], MOD - 2, MOD);
	for (int i = n - 1; i >= 0; i--) g[i] = g[i + 1] * (i + 1) % MOD;
}
int main()
{
	int a, b, c, d, k; cin >> a >> b >> c >> d >> k;
	init();
	LL ret = 0;
	for (int x = 0; x <= k; x++)
	{
		LL l = C(d, x) * C(c, x) % MOD * f[x];
		LL r = C(b + d - x, k - x) * C(a, k - x) % MOD * f[k - x] % MOD;
		ret = (ret + l * r % MOD) % MOD;
	}
	cout << ret << endl;
	return 0;
}